Variational representation , HCR and CR lower bounds

نویسندگان

  • Yihong Wu
  • Georgios Rovatsos
چکیده

It should be noted that the requirement of f to be convex in the definition of f -divergence is essential. In Euclidean spaces any convex function can be represented as the pointwise supremum of a family of affine functions and vice versa, every supremum of a family of affine functions produces a convex function. Take f(x) = 12 |x− 1| as an example. We see that it can be written as a pointwise supremum of f1(x) = 1 2(x − 1) and f2(x) = 1 2(1 − x). This remark can be used not only as a geometric interpretation of convex functions but as a definition of convexity. For f -divergences which are convex functions of probability measures, its variational representation amounts to writing it as a pointwise supremum of affine functions.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some lower bounds for the $L$-intersection number of graphs

‎For a set of non-negative integers~$L$‎, ‎the $L$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $A_v subseteq {1,dots‎, ‎l}$ to vertices $v$‎, ‎such that every two vertices $u,v$ are adjacent if and only if $|A_u cap A_v|in L$‎. ‎The bipartite $L$-intersection number is defined similarly when the conditions are considered only for the ver...

متن کامل

Strong convergence of a general implicit algorithm for variational inequality problems and equilibrium problems and a continuous representation of nonexpansive mappings

We introduce a general implicit algorithm for finding a common element of‎ ‎the set of solutions of systems of equilibrium problems and the set of common fixed points‎ ‎of a sequence of nonexpansive mappings and a continuous representation of nonexpansive mappings‎. ‎Then we prove the strong convergence of the proposed implicit scheme to the unique solution of the minimization problem on the so...

متن کامل

Strong convergence for variational inequalities and equilibrium problems and representations

We introduce an implicit method for nding a common element of the set of solutions of systems of equilibrium problems and the set of common xed points of a sequence of nonexpansive mappings and a representation of nonexpansive mappings. Then we prove the strong convergence of the proposed implicit schemes to the unique solution of a variational inequality, which is the optimality condition for ...

متن کامل

Approximation of fixed points for a continuous representation of nonexpansive mappings in Hilbert spaces

This paper introduces an implicit scheme for a   continuous representation of nonexpansive mappings on a closed convex subset of a Hilbert space with respect to a   sequence of invariant means defined on an appropriate space of bounded, continuous real valued functions of the semigroup.   The main result is to    prove the strong convergence of the proposed implicit scheme to the unique solutio...

متن کامل

Lower bounds for the Crossing Number of the Cartesian Product of a Vertex-transitive Graph with a Cycle

The minimum number of crossings for all drawings of a given graph G on a plane is called its crossing number, denoted cr(G). Exact crossing numbers are known only for a few families of graphs, and even the crossing number of a complete graph Km is not known for all m. Wenping et al. showed that cr(Km2Cn) > n · cr(Km+2) for n > 4 and m > 4. We adopt their method to find a lower bound for cr(G2Cn...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016